Footstep planning among obstacles for biped robots
نویسندگان
چکیده
We present an algorithm for planning safe navigation strategies for biped robots moving in obstaclecluttered environments. From a discrete set of plausible statically-stable, single-step motions, a forward dynamic programming approach is used to compute a sequence of feasible footstep locations. In contrast to existing navigation strategies for mobile robots, our method is a global method that takes into account the unique ability of legged robots such as bipedal humanoids to traverse obstacles by stepping over them. Heuristics designed to minimize the number and complexity of the step motions are used to encode cost functions used for searching a footstep transition graph. We show preliminary results of an experimental implementation of the algorithm using a model of the H6 humanoid navigating on an office floor littered with obstacles.
منابع مشابه
Planning Biped Navigation Strategies in Complex Environments
We present an algorithm for planning goal-directed footstep navigation strategies for biped robots through obstacle-filled environments and uneven ground. Planning footsteps is more general than most existing navigation methods designed for wheeled robots, since the options of stepping over or upon obstacles are available. Given a height map of the terrain and a discrete set of possible footste...
متن کاملOnline footstep planning for humanoid robots
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general than most existing navigation methods designed for wheeled robots, since the options of stepping over or upon obstacles in a cluttered terrain are available. Given a discrete set of plausible footstep locations, a for...
متن کاملEvolutionary Multi-Objective Optimization for Biped Walking of Humanoid Robot 127 Evolutionary Multi-Objective Optimization for Biped Walking of Humanoid Robot
The recent remarkable progress of robotics research makes advanced skills for robots to solve complex tasks. The divide-and-conquer approach is an intuitive and efficient method when we encounter complex problems. Being a divide-and-conquer approach, the multilayered system decomposes the problem into a set of levels and each level implements a single task-achieving behaviour. Many researchers ...
متن کاملConvex Segmentation and Mixed-Integer Footstep Planning for a Walking Robot
This work presents a novel formulation of the footstep planning problem as a mixed-integer convex optimization. The footstep planning problem involves choosing a set of footstep locations which a walking robot can follow to safely reach a goal through an environment with obstacles. Rather than attempting to avoid the obstacles, which would require nonconvex constraints, we use integer variables...
متن کاملGlobal Step Planning of Dynamic Biped Locomotion Considering Obstacles
This paper concerns on footstep planning of a biped robot in an environment having some obstacles. Biped robot has an advantage to work in human surroundings: This is accomplished by its capability to walk over the obstacles. Though its foot placement should be discussed to step over obstacles, it is difficult because dynamic biped locomotion is a complex interaction system between CoG trajecto...
متن کامل